A Distributed Algorithm for Solving Linear Algebraic Equations Over Random Networks
نویسندگان
چکیده
This article considers the problem of solving linear algebraic equations form Ax=b among multiagents, which seek a solution by using local information in presence random communication topologies. The equation is solved m agents where each agent only knows subset rows partitioned matrix [A,b]. formulated such that this formulation does not need distribution interconnection graphs. Therefore, framework includes asynchronous updates and/or unreliable protocols. Krasnoselskii-Mann iterative algorithm applied converges almost surely and mean square to for any matrices A b initial conditions agents' states. totally without requiring priori B-connectivity dependency assumptions. able solve even if weighted graph periodic irreducible synchronous protocol. It demonstrated limit point states converge determined unique convex optimization regardless Finally, some numerical examples are given show results.
منابع مشابه
A matrix LSQR algorithm for solving constrained linear operator equations
In this work, an iterative method based on a matrix form of LSQR algorithm is constructed for solving the linear operator equation $mathcal{A}(X)=B$ and the minimum Frobenius norm residual problem $||mathcal{A}(X)-B||_F$ where $Xin mathcal{S}:={Xin textsf{R}^{ntimes n}~|~X=mathcal{G}(X)}$, $mathcal{F}$ is the linear operator from $textsf{R}^{ntimes n}$ onto $textsf{R}^{rtimes s}$, $ma...
متن کاملa matrix lsqr algorithm for solving constrained linear operator equations
in this work, an iterative method based on a matrix form of lsqr algorithm is constructed for solving the linear operator equation $mathcal{a}(x)=b$ and the minimum frobenius norm residual problem $||mathcal{a}(x)-b||_f$ where $xin mathcal{s}:={xin textsf{r}^{ntimes n}~|~x=mathcal{g}(x)}$, $mathcal{f}$ is the linear operator from $textsf{r}^{ntimes n}$ onto $textsf{r}^{rtimes s}$, $ma...
متن کاملDistributed Asynchronous Algorithms for Solving Positive Definite Linear Equations over Dynamic Networks
This paper develops Subset Equalizing (SE), a distributed algorithm for solving a symmetric positive definite system of linear equations over a network of agents with arbitrary asynchronous interactions and membership dynamics, where each agent may join and leave the network at any time, for infinitely many times, and may lose all its memory upon leaving. To design and analyze SE, we introduce ...
متن کاملSeventh-order iterative algorithm free from second derivative for solving algebraic nonlinear equations
متن کامل
GGMRES: A GMRES--type algorithm for solving singular linear equations with index one
In this paper, an algorithm based on the Drazin generalized conjugate residual (DGMRES) algorithm is proposed for computing the group-inverse solution of singular linear equations with index one. Numerical experiments show that the resulting group-inverse solution is reasonably accurate and its computation time is significantly less than that of group-inverse solution obtained by the DGMRES alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2021
ISSN: ['0018-9286', '1558-2523', '2334-3303']
DOI: https://doi.org/10.1109/tac.2020.3010264